// Hydro submission #63e1e82c9ae2a264272990b4@1675749420853
#include<bits/stdc++.h>
using namespace std;
int n;
double px[105],py[105],pz[105];
double ansx,ansy,ansz;
double calc3(){
double res=0;
for(int i=1;i<=n;i++)res=max(res,(ansx-px[i])*(ansx-px[i])+(ansy-py[i])*(ansy-py[i])+(ansz-pz[i])*(ansz-pz[i]));
return res;
}
double calc2(){
double l=-1e4,r=1e4;
while(l+1e-7<=r){
double mid1=l+(r-l)/3,mid2=r-(r-l)/3;
ansz=mid1;
double val1=calc3();
ansz=mid2;
double val2=calc3();
if(val1>val2)l=mid1;
else r=mid2;
}
ansz=l;
return calc3();
}
double calc1(){
double l=-1e4,r=1e4;
while(l+1e-7<=r){
double mid1=l+(r-l)/3,mid2=r-(r-l)/3;
ansy=mid1;
double val1=calc2();
ansy=mid2;
double val2=calc2();
if(val1>val2)l=mid1;
else r=mid2;
}
ansy=l;
return calc2();
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%lf%lf%lf",&px[i],&py[i],&pz[i]);
double l=-1e4,r=1e4;
while(l+1e-7<=r){
double mid1=l+(r-l)/3,mid2=r-(r-l)/3;
ansx=mid1;
double val1=calc1();
ansx=mid2;
double val2=calc1();
if(val1>val2)l=mid1;
else r=mid2;
}
ansx=l;
calc1();
printf("%.6lf %.6lf %.6lf\n",ansx,ansy,ansz);
return 0;
}
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |